Tri-level Robust Clustering Ensemble with Multiple Graph Learning
نویسندگان
چکیده
Clustering ensemble generates a consensus clustering result by integrating multiple weak base results. Although it often provides more robust results compared with single methods, still suffers from the robustness problem if does not treat unreliability of carefully. Conventional methods use all data for ensemble, while ignoring noises or outliers on data. some are proposed, which extract data, they characterize in level, and thus cannot comprehensively handle complicated problem. In this paper, to address problem, we propose novel Tri-level Robust Ensemble (TRCE) method transforming graph learning Just as its name implies, proposed tackles three levels: level instance level. By considering comprehensive way, TRCE can achieve result. Experimental benchmark datasets also demonstrate it. Our outperforms other state-of-the-art methods. Even ours performs better.
منابع مشابه
An ensemble learning strategy for graph clustering
This paper is on a graph clustering scheme inspired by ensemble learning. In short, the idea of ensemble learning is to learn several weak classifiers and use these weak classifiers to form a strong classifier. In this contribution, we use the generic procedure of ensemble learning and determine several weak graph clusterings (with respect to the objective function). From the partition given by...
متن کاملLearning Robust Graph Regularisation for Subspace Clustering
Various subspace clustering methods have benefited from introducing a graph regularisation term in their objective functions. In this work, we identify two critical limitations of the graph regularisation term employed in existing subspace clustering models and provide solutions for both of them. First, the squared l2-norm used in the existing term is replaced by a l1-norm term to make the regu...
متن کاملEnsemble clustering using factor graph
In this paper, we propose a new ensemble clustering approach termed ensemble clustering using factor graph (ECFG). Compared to the existing approaches, our approach has three main advantages: (1) the cluster number is obtained automatically and need not to be specified in advance; (2) the reliability of each base clustering can be estimated in an unsupervised manner and exploited in the consens...
متن کاملRobust Synchronization-Based Graph Clustering
Complex graph data now arises in various fields like social networks, protein-protein interaction networks, ecosystems, etc. To reveal the underlying patterns in graphs, an important task is to partition them into several meaningful clusters. The question is: how can we find the natural partitions of a complex graph which truly reflect the intrinsic patterns? In this paper, we propose RSGC, a n...
متن کاملA Robust Convex Formulation for Ensemble Clustering
We formulate ensemble clustering as a regularization problem over nuclear norm and cluster-wise group norm, and present an efficient optimization algorithm, which we call Robust Convex Ensemble Clustering (RCEC). A key feature of RCEC allows to remove anomalous cluster assignments obtained from component clustering methods by using the group-norm regularization. Moreover, the proposed method is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i12.17327